Approximation algorithms for lawn mowing and milling

نویسندگان

  • Esther M. Arkin
  • Sándor P. Fekete
  • Joseph S. B. Mitchell
چکیده

We study the problem of finding shortest tours/paths for “lawn mowing” and “milling” problems: Given a region in the plane, and given the shape of a “cutter” (typically, a circle or a square), find a shortest tour/path for the cutter such that every point within the region is covered by the cutter at some position along the tour/path. In the milling version of the problem, the cutter is constrained to stay within the region. The milling problem arises naturally in the area of automatic tool path generation for NC pocket machining. The lawn mowing problem arises in optical inspection, spray painting, and optimal search planning. Both problems are NP-hard in general. We give efficient constant-factor approximation algorithms for both problems. In particular, we give a (3+ǫ)-approximation algorithm for the lawn mowing problem and a 2.5-approximation algorithm for the milling problem. Furthermore, we give a simple 6 5 -approximation algorithm for the TSP problem in simple grid graphs, which leads to an 11 5 -approximation algorithm for milling simple rectilinear polygons.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0925-7721(00)00015-8

We study the problem of finding shortest tours/paths for “lawn mowing” and “milling” problems: Given a region in the plane, and given the shape of a “cutter” (typically, a circle or a square), find a shortest tour/path for the cutter such that every point within the region is covered by the cutter at some position along the tour/path. In the milling version of the problem, the cutter is constra...

متن کامل

Minimum Covering with Travel Cost

Given a polygon and a visibility range, the Myopic Watchman Problem with Discrete Vision (MWPDV) asks for a closed path P and a set of scan points S , such that (i) every point of the polygon is within visibility range of a scan point; and (ii) path length plus weighted sum of scan number along the tour is minimized. Alternatively, the bicriteria problem (ii’) aims at minimizing both scan numbe...

متن کامل

A Tele-Autonomous Heavy Duty Robotic Lawn Mower

This paper describes the development of a robotic heavy duty lawn mower provided with a rich set of sensors which initially provide tele-operation mode capabilities but will support extension towards full autonomy via an intermediate mode termed teleautonomous to reflect a multilevel control structure which permits graceful withdrawal of human guidance as the development proceeds.

متن کامل

Lawn mower-related injuries to children.

Lawn mower-related injuries to children are relatively common and can result in severe injury or death. Many amputations during childhood are caused by power mowers. Pediatricians have an important role as advocates and educators to promote the prevention of these injuries.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2000